A Note on Data Types Supporting E cient Implementations of Polynomial Arithmetics
نویسنده
چکیده
There are discussed implementational aspects of the special-purpose computer algebra system FELIX designed for computations in constructive algebra. In particular, data types developed for the representation of and computation with commutative and non-commutative polynomials are described. Furthermore, comparisons of time and memory requirements of di erent polynomial representations are reported.
منابع مشابه
Some results on the polynomial numerical hulls of matrices
In this note we characterize polynomial numerical hulls of matrices $A in M_n$ such that$A^2$ is Hermitian. Also, we consider normal matrices $A in M_n$ whose $k^{th}$ power are semidefinite. For such matriceswe show that $V^k(A)=sigma(A)$.
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملAiaa 9993309 Eecient Implementations of the Quadrature-free Discontinuous Galerkin Method Efficient Implementations of the Quadrature-free Discontinuous Galerkin Method
The e ciency of the quadrature-free form of the discontinuous Galerkin method in two dimensions, and brie y in three dimensions, is examined. Most of the work for constant-coe cient, linear problems involves the volume and edge integrations, and the transformation of information from the volume to the edges. These operations can be viewed as matrix-vector multiplications. Many of the matrices a...
متن کاملCenters and isochronous centers for generalized quintic systems
In this paper we classify the centers and the isochronous centers of certain polynomial differential systems in R2 of degree d ≥ 5 odd that in complex notation can be written as ż = (λ+ i)z + (zz̄) d−5 2 (Az +Bzz̄ + Czz̄ +Dzz̄ + Ezz̄ + F z̄), where λ ∈ R and A,B,C,D,E, F ∈ C. Note that if d = 5 we obtain the full class of polynomial differential systems of the form a linear system with homogeneous po...
متن کاملComputation on Zagreb Polynomial of Some Families of Dendrimers
In mathematical chemistry, a particular attention is given to degree-based graph invariant. The Zagrebpolynomial is one of the degree based polynomials considered in chemical graph theory. A dendrimer isan artificially manufactured or synthesized molecule built up from branched units called monomers. Inthis note, the first, second and third Zagreb poly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998